Query Rewriting Using Views in a Typed Mediator Environment
نویسندگان
چکیده
Query rewriting method is proposed for the heterogeneous information integration infrastructure formed by the subject mediator environment. Local as View (LAV) approach treating schemas exported by sources as materialized views over virtual classes of the mediator is considered as the basis for the subject mediation infrastructure. In spite of significant progress of query rewriting with views, it remains unclear how to rewrite queries in the typed, objectoriented mediator environment. This paper embeds conjunctive views and queries into an advanced canonical object model of the mediator. The “selectionprojection-join” (SPJ) conjunctive query semantics based on type specification calculus is introduced. The paper demonstrates how the existing query rewriting approaches can be extended to be applicable in such typed environment. The paper shows that refinement of the mediator class instance types by the source class instance types is the basic relationship required for establishing query containment in the object environment.
منابع مشابه
Efficient XML Query Rewriting over the Multiple XML Views
{gaojun, dqyang, tjwang }@ pku.edu.cn Abstract XML query rewriting in the distributed computing environment receives high attention recently. Different from existing work, we focus on the query rewriting in the cases that there are multiple views at the client side. We design two data structures to manage the multiple XML views. MPTree is constructed from the main path of the XML views to gener...
متن کاملQuery rewritings using views for XPath queries, framework, and methodologies
Query rewriting using views is a technique that allows a query to be answered efficiently by using pre-computed materialized views. It has many applications, such as data caching, query optimization, schema integration, etc. This issue has been studied extensively for relational databases and, as a result, the technology is maturing. For XML proposed for query rewriting using views for XPath qu...
متن کاملOn Tree Pattern Query Rewriting Using Views
We study and present our findings on two closely related problems on xpath rewriting using views when both the view and the query are tree patterns involving /,// and []. First, given view V and query Q, is it possible for Q to have an equivalent rewriting using V which is the union of two or more tree patterns, but not an equivalent rewriting which is a single pattern? This problem is of both ...
متن کاملComplete and Equivalent Query Rewriting Using Views
Query rewriting using views is a technique for answering a query using a set of views instead of accessing the database relations directly. There are two categories of rewritings, i.e., equivalent rewriting using materialized views applied in query optimization, and maximally contained rewriting used in data integration. Although maximally contained rewriting is acceptable in data integration, ...
متن کاملQuery Rewriting using Semistructured Views
We consider the problem of rewriting semistructured queries using semistructured views. Given a client semistructured positive non-recursive query and a set of semistructured views, the algorithm nds a rewriting query that is equivalent to the client query and accesses only the views. Our solution is based on appropriately generalizing well understood techniques such as containment mappings and...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004